Probabilities of First - Order Sentences about Unary Functions
نویسندگان
چکیده
Let / be any fixed positive integer and a a sentence in the first-order predicate calculus of/unary functions. For positive integers n, an «-structure is a model with universe {0,1,...,« 1} and/unary functions, and p(n,a) is the ratio of the number of «-structures satisfying a to n"f, the number of «-structures. We show that lim„_00/i(«, a) exists for all such a, and its value is given by an expression consisting of integer constants and the operators +,-,,/, and ex.
منابع مشابه
Nonconvergence, undecidability, and intractability in asymptotic problems
Results delimiting the logical and effective content of asymptotic combinatorics are presented. For the class of binary relations with an underlying linear order, and the class of binary functions, there are properties, given by first-order sentences, without asymptotic probabilities; every first-order asymptotic problem (i.e., set of first-order sentences with asymptotic probabilities bounded ...
متن کاملApplication of a Tauberian theorem to finite model theory
An extension of a Tauberian theorem of Hardy and Littlewood is proved. It is used to show that, for classes of finite models satisfying certain combinatorial and growth properties, Cesfiro probabilities (limits of average probabilities over second order sentences) exist. Examples of such classes include the class of unary functions and the class of partial unary functions. It is conjectured tha...
متن کاملAsymptotic Conditional Probabilities: The Non-Unary Case
Motivated by problems that arise in computing degrees of belief, we consider the problem of computing asymptotic conditional probabilities for first-order sentences. Given first-order sentences φ and θ, we consider the structures with domain {1, . . . , N} that satisfy θ, and compute the fraction of them in which φ is true. We then consider what happens to this fraction as N gets large. This ex...
متن کاملAsymptotic Conditional Probabilities: The Unary Case
Motivated by problems that arise in computing degrees of belief, we consider the problem of computing asymptotic conditional probabilities for first-order sentences. Given firstorder sentences φ and θ, we consider the structures with domain {1, . . . , N} that satisfy θ, and compute the fraction of them in which φ is true. We then consider what happens to this fraction as N gets large. This ext...
متن کاملLimit Probabilities for Random Sparse Bit Strings
Let n be a positive integer, c a real positive constant, and p(n) = c/n. Let Un,p be the random unary predicate under the linear order, and Sc the almost sure theory of Un, c n . We show that for every first-order sentence φ: fφ(c) = lim n→∞Pr[Un, c n has property φ] is an infinitely differentiable function. Further, let S = ⋂ c Sc be the set of all sentences that are true in every almost sure ...
متن کامل